On the Foundations of Corecursion

نویسندگان

  • Lawrence S. Moss
  • Norman Danner
چکیده

We consider foundational questions related to the de nition of functions by corecursion. This method is especially suited to functions into the greatest xed point of some monotone operator, and it is most applicable in the context of non-wellfounded sets. We review the work on the Special Final Coalgebra Theorem of Aczel [NWF] and the Corecursion Theorem of Barwise and Moss [VC]. We prove some results relating the two approaches, and we present a framework from which one can derive the results of both.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Programming and Reasoning with Infinite Data in Isabelle/HOL

Recently we have endowed the proof assistant Isabelle/HOL with a powerful framework for programming with, and reasoning about, infinite objects such as streams and infinite-depth trees. It implements the paradigm of total/productive coprogramming, and is based on a modular design of coinductive datatypes. The tutorial will present this framework through examples taken from the field of programm...

متن کامل

Dialgebraic Semantics of Typed Object Calculi

Algebraic data type theory has a notion of structural recursion. Coalgebraic data types similarly have a notion of structural corecursion. In this thesis we study a third form of recursion: direcursion. The other two notions have been used in program derivations, correctness proofs, and in foundations of functional and class-based languages. Direcursion, on the other hand, has not been extensiv...

متن کامل

A categorical (fixed point) foundation for cognition: (adjoint) corecursion

Abstract: Computationalism has been the pre-eminent framework for models of mind, since the cognitive revolution. However, the plethora of apparently incommensurate approaches seems to undermine hope for a common computational foundation. Category theory provides a mathematically rigorous foundation for computation that includes recursion and corecursion. We show that corecursion unifies variou...

متن کامل

Friends with Benefits: Implementing Foundational Corecursion in Isabelle/HOL (Extended Abstract)

We describe AmiCo, a tool that extends Isabelle/HOL with flexible function definitions well beyond primitive corecursion. All definitions are certified by the assistant’s inference kernel to guard against inconsistencies. A central notion is that of friends: functions that preserve the productivity of their arguments and that may occur in corecursive call contexts. As new friends are registered...

متن کامل

Corecursive Algebras: A Study of General Structured Corecursion (Extended Abstract)

We study general structured corecursion, dualizing the work of Osius, Taylor, and others on general structured recursion. We call an algebra of a functor corecursive if it supports general structured corecursion: there is a unique map to it from any coalgebra of the same functor. The concept of antifounded algebra is a statement of the bisimulation principle. We show that it is independent from...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Logic Journal of the IGPL

دوره 5  شماره 

صفحات  -

تاریخ انتشار 1997